Differentiability of continuous homomorphisms between smooth loops
نویسندگان
چکیده
منابع مشابه
Differentiability, Convenient Spaces and Smooth Diffeologies
We review the basic definitions and properties concerning smooth structures, convenient spaces, diffeological spaces and tangent structures. The relation between the first two is described. A tangent structure is constructed for each pre-convenient space. This one is proved to be convenient if and only if the space and the tangent fibres
متن کاملBorel homomorphisms of smooth σ-ideals
Given a countable Borel equivalence relation E on a Polish space, let IE denote the σ-ideal generated by the Borel partial transversals of E. We show that there is a Borel homomorphism from IE to IF if and only if there is a smooth-to-one Borel homomorphism from a finite index Borel subequivalence relation of E to F . As a corollary, we see that IE is homogeneous in the sense of Zapletal (2007,...
متن کاملConstruction of Homomorphisms of ^-continuous Lattices
We present a direct approach to constructing homomorphisms of A/-continuous lattices, a generalization of continuous lattices, into the unit interval, and show that an M -continuous lattice has sufficiently many homomorphisms into the unit interval to separate the points. In the past twenty years the concept of a continuous lattice and its generalizations have attracted more and more attention....
متن کاملHomomorphisms between Diffeomorphism Groups
For r ≥ 3, p ≥ 2, we classify all actions of the groups Diffc(R) and Diff+(S) by Cdiffeomorphisms on the line and on the circle. This is the same as describing all nontrivial group homomorphisms between groups of compactly supported diffeomorphisms on 1-manifolds. We show that all such actions have an elementary form, which we call topologically diagonal. As an application, we answer a question...
متن کاملGraph Homomorphisms between Trees
In this paper we study several problems concerning the number of homomorphisms of trees. We begin with an algorithm for the number of homomorphisms from a tree to any graph. By using this algorithm and some transformations on trees, we study various extremal problems about the number of homomorphisms of trees. These applications include a far reaching generalization and a dual of Bollobás and T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Results in Mathematics
سال: 1994
ISSN: 0378-6218,1420-9012
DOI: 10.1007/bf03323137